The theory of directional partial derivative in Banach spaces was established. Some new concepts, important theorems and the coordinate method of minimizing sequence were given. 应用Banach空间中的广义Schauder基,建立了Banach空间中方向偏导数理论,给出了几个重要定理和泛函极小化序列的坐标法构造。
On the selection of primer in PCR experiments, we prove that minimizing the number of primers needed for amplification of a collection of DNA sequence is NP-complete. Then we design and implement a branch-and-bound algorithm and a greedy heuristic approximation algorithm. 在PCR试验中的引物选择问题中,证明了对扩展&DNA序列集合所需的引物个数进行最小化问题是NP-complete,设计并实现了分支限界算法和启发式贪婪近似算法。
In the time domain pilot channel estimation, this thesis researches an algorithm based on the maximum likelihood principle. By minimizing the mean square error of channel estimation, the optimal training sequence suitable for the channel estimation method is obtained. 在基于时域导频的信道估计方法中,研究了一种基于最大似然准则的时域导频信道估计方法,并根据信道估计误差最小的原则,理论上推导出了适用于该估计方法的训练序列。
In this paper, we study some properties and distinguishing methods of LP minimizing sequence on constrained convex optimization problems in R~ N space. 主要在R~N空间下讨论了有约束的凸最优化问题中LP最小值序列的性质及判别方法。
The properties of LP minimizing sequence of unsmooth convex function are given, and its relationship between stationary sequences is obtained. 研究了非光滑凸函数的LP最小值序列的性质,并给出了它与稳定序列之间的关系。
With the help of the Carleman inequality and the periodic condition, we get the boundness of a minimizing sequence { yn} to problem ( P) in a suitable space. 借助Carleman不等式及方程的周期性条件,我们得到了最小化序列在相应空间的有界性。
In this thesis, a new way of defining the time series is proposed, whose virtue resides in minimizing the total distance from the central sequence to other sequences, and is therefore more representative. 本文提出了一种新的中心序列的定义方法。这种定义的优点在于能够使中心序列到其他序列的距离和最小,从而更具有代表性。